Monochromatic Clique Decompositions of Graphs
نویسندگان
چکیده
Let G be a graph whose edges are colored with k colors, and H=(H1,⋯,Hk) be a k-tuple of graphs. A monochromatic H-decomposition of G is a partition of the edge set of G such that each part is either a single edge or forms a monochromatic copy of Hi in color i, for some 1≤i≤k. Let φk(n,H) be the smallest number ϕ, such that, for every order-n graph and every k-edge-coloring, there is a monochromatic H-decomposition with at most ϕ elements. Extending the previous results of Liu and Sousa [Monochromatic Kr-decompositions of graphs, J Graph Theory 76 (2014), 89-100], we solve this problem when each graph in H is a clique and n≥n0(H) is sufficiently large.
منابع مشابه
On the complexity of edge-colored subgraph partitioning problems in network optimization
Network models allow one to deal with massive data sets using some standard concepts from graph theory. Understanding and investigating the structural properties of a certain data set is a crucial task in many practical applications of network optimization. Recently, labeled network optimization over colored graphs has been extensively studied. Given a (not necessarily properly) edge-colored gr...
متن کاملUpper bounds to the clique width of graphs
A graph complexity measure that we call clique-width is associated in a natural way with certain graph decompositions, more or less like tree-width is associated with tree-decomposition which are, actually, hierarchical decompositions of graphs. In general, a decomposition of a graph G can be viewed as a nite term, written with appropriate operations on graphs, that evaluates to G. Innnitely ma...
متن کاملMonochromatic Kr-Decompositions of Graphs
Given graphs G and H, and a colouring of the edges of G with k colours, a monochromatic H-decomposition of G is a partition of the edge set of G such that each part is either a single edge or forms a monochromatic graph isomorphic to H. Let φk(n,H) be the smallest number φ such that any k-edge-coloured graph G of order n, admits a monochromatic H-decomposition with at most φ parts. Here we stud...
متن کاملClasses of graphs with small rank decompositions are X-bounded
A class of graphs G is χ-bounded if the chromatic number of graphs in G is bounded by a function of the clique number. We show that if a class G is χ-bounded, then every class of graphs admitting a decomposition along cuts of small rank to graphs from G is χ-bounded. As a corollary, we obtain that every class of graphs with bounded rank-width (or equivalently, clique-width) is χ-bounded.
متن کاملCohen-Macaulay $r$-partite graphs with minimal clique cover
In this paper, we give some necessary conditions for an $r$-partite graph such that the edge ring of the graph is Cohen-Macaulay. It is proved that if there exists a cover of an $r$-partite Cohen-Macaulay graph by disjoint cliques of size $r$, then such a cover is unique.
متن کامل